Approximation algorithms for maximum latency and partial cycle cover

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation algorithms for maximum latency and partial cycle cover

We present approximation algorithms for four variations of the maximum latency problem. We consider symmetric graphs and asymmetric graphs and both with general edge weights or weights satisfying the triangle inequality. Moreover, in each variation the starting point of the tour may either be given in the input or be a decision variable. As a tool for our solution, we use a PTAS for the maximum...

متن کامل

Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems

We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40 -approximation algorithm for ∆-Max-ATSP and a 34 -approximation algorithm for Max-3-DCC with polynomial running time. The results are obtained via a new way of applying techniques for computing undirected cycle covers to directed problems.

متن کامل

Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems

We study the complexity of several parameterizations for max k-set cover. Given a family of subsets S = {S1, . . . , Sm} over a set of elements X = {x1, . . . , xn} and an integer p, max k-set cover consists of finding a set T of at most k subsets covering at least p elements. This problem, when parameterized by k, is W[2]-hard. Here, we settle the multiparameterized complexity of max k-set cov...

متن کامل

Improved Approximation Algorithms for Connected Sensor Cover

Wireless sensor networks have recently posed many new system building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Optimization

سال: 2009

ISSN: 1572-5286

DOI: 10.1016/j.disopt.2008.12.003